搜索资源列表
tree
- 验证二叉树的功能，能实现先序输入，简单查找，输出节点data等功能-Verify the function of a binary tree, to achieve the first order input, a simple search, data output node functions
tree
- 1 建立二叉树 1）通过输入树的嵌套括号表示序列 2）根据前序遍历序列和中序遍历序列建立二叉树 3）建立哈夫曼树 2. 对于1中1），2）所建立的树进行如下操作： 1）查找结点 2）前序遍历 3）中序遍历 3 对于建立的哈夫曼树进行编码 4 输出二叉树的形状-1 Create a binary 1) by entering the sequence of the tree of nested brackets 2) According to the preorder traversal sequ
TreeImageDrag
- 实现的功能有把树控件上的节点拖动到列表框中，或者把树节点拖动要树上的其他地方，主要就是这个拖动的实例-Function can be achieved on the control node to drag the tree to the list box, or drag the tree node to other parts of the tree, the main drag is this an instance of
CTreeCtrl
- 主要功能就是给树控件添加图片和逐层展开的功能，还有就是删除，添加，修改树节点功能-Main function is to add controls to the tree and then deploy the image features, there is a delete, add, modify the tree node function
MINIMALpATH
- A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node
travel
- 本程序可实现二叉树的构造，对树的节点没有限制，并实现树的各种遍历，-This procedure enables the binary tree structure, there is no restriction on the tree node, and to achieve a variety of tree traversal,
RB_Tree
- 红黑树的算法模拟。红黑树的生成，结点的插入、删除和调整。通过类的方式管理。-Red-black tree algorithm simulation. The formation of red-black tree, node insertion, deletion, and adjustment. Administered by the class.
binary-tree
- 二叉树也是递归定义的，其结点有左右子树之分，逻辑上二叉树有五种基本形态： (1)空二叉树——(a)； (2)只有一个根结点的二叉树——(b)； (3)右子树为空的二叉树——(c)； (4)左子树为空的二叉树——(d)； (5)完全二叉树——(e)注意：尽管二叉树与树有许多相似之处，但二叉树不是树的特殊情形-Binary tree is recursively defined, and its sub-tree nodes are so divided, there are five basic
note
- 一个VC++文档管理器，包含了树形控件的构造及其信息的保存和读龋它能动态生成无限级的树形节点-A VC++ document management, the structure contains a tree control and the information it can save and read dynamically generated caries unlimited level tree node
a-binary-tree
- 在采用链式存储结构的二叉树上，以bt指向根结点，p指向任一给定的结点，编程实现求出从根结点到给定结点之间的路径。主要是对二叉树的存储结构及其在二叉链表树上的各种操作加深理解。-The introduction of chain stores on the binary tree structure to point to the root bt, p point to any given node, programming derived from the root to the given p
binary-tree
- 1) 用先序递归过程建立二叉树（存储结构：二叉链表） 输入数据按先序遍历所得序列输入，当某节点左子树或右子树为空时，输入‘*’号，如输入abc**d**e** 2) 编写递归算法，计算二叉树中叶子结点的数目。 3）按凹入表方式输出该二叉树。 -1) The process established by the first order recursive binary tree (memory structure: binary list) input data sequen
Tree
- 系统故障树模拟...利用MFC模拟系统故障树的建立、插入节点、删除节点、更改关系以及矩阵法求最小路集等功能-System fault tree simulation ... simulation system using MFC Fault Tree Construction, insert node, delete node, change the relationship and find minimal path set matrix method and other functions
Tree-in-java
- Tree in sql 的java实现，将数据库中的树形结构表，转换为左右节点树的第三方表。-Tree in SQL database of Java realized, will watch the Tree structure, convert third table around a node Tree.
TreeView
- TreeView树状控件节点动态拖拉操作-Tree node TreeView control dynamically drag operation
JtreeDemo
- java语言高级编程 使用java中的tree，可以对tree进行事件操作，删除树节点，添加树节点等-high-level programming using java language java in the tree, can operate on the tree for the event, remove the tree node, add the tree node, etc.
Sudoku-dengqiong
- 数独~~1、嵌套循环（最简单的行代码就解出来一个解） 2、深度优先搜索（将数独作为树节点，建立深度优先搜索树，也是只解一个解） 还有关于这个的设计~~~ -Sudoku- ~ 1, nested loops (the most simple lines of code out a solution on the solution) 2, depth-first search (to Sudoku as a tree node, to establish the depth-fi
First-order-binary-tree-traversal
- 二叉树先序遍历，二叉树先序遍历树种的各节点-First order binary tree traversal, preorder traversal of binary tree each node of tree species
Binary-tree
- 建立二叉树存储结构,求二叉树的前序中序后序遍历,以及求指定节点的路径-The establishment of binary storage structure, seeking pre-order binary tree traversal in order after the order, and find the path specified node
erchashu
- 实现一个二叉树类，要求实现二叉树的建立、结点插入、结点删除、线索化等操作。-to implement a binary tree class, required to achieve the establishment of a binary tree, node insertion, node deletion, threaded and other operations.
rtree
- 基于JAVA的R树空间索引树，用于查询空间对象空间节点间的关系。-JAVA-based R-tree spatial index tree node for the query space spatial relationships between objects.